Research Statement of Prof

My research is primarily concerned with problems related to the theoretical aspects of the analysis and design of algorithms. Although I have studied many classical problems including those that can be found in standard textbook in algorithms (for example, string matching [16, 25, 34, 35], k-connectivity problems in graphs [9, 18, 20], and the problem of finding an optimum order of multiplying a sequence of matrices [30, 36]), recently my research is more concerned with advanced topics related to the analysis of randomized algorithms and their underlying stochastic processes (e.g., analyzes of Markov chains, allocation processes, network processes/algorithms, and the Lovász Local Lemma). In general, my research work, which has been accomplished in collaboration with several other researchers, may be loosely classified into four categories: